منابع مشابه
Update games and update networks
Inthispaperwemodelinfiniteprocesseswithfiniteconfigurationsasinfinitegames overfinitegraphs.W einvestigatethosegames,calledupdategames,inwhicheachconfigurationoccursan infinitenumberoftimesduring atwo-person play.W ealso presentan efficient polynomial-time algorithm (and partialcharacterization)fordeciding ifa graph isan update network.
متن کاملNeonatal Sepsis: An Update
Sepsis is the most common cause of neonatal mortality. As per National Neonatal-Perinatal Database (NNPD), 2002-2003, the incidence of neonatal sepsis in India was 30 per 1000 live births. Signs and symptoms of sepsis are nonspecific; therefore empirical antimicrobial therapy is promptly initiated after obtaining appropriate cultures. The early manifestations of neonatal sepsis are vague and il...
متن کاملCadmium toxicity and treatment: An update
Cadmium poisoning has been reported from many parts of the world. It is one of the global health problems that affect many organs and in some cases it can cause deaths annually. Long-term exposure to cadmium through air, water, soil, and food leads to cancer and organ system toxicity such as skeletal, urinary, reproductive, cardiovascular, central and peripheral nervous, and respiratory systems...
متن کاملMultiple Myeloma Update
This literature review presents the most recent developments in the management of multiple myeloma, which is characterized by the presence of abnormal plasma cells (myeloma cells) that accumulate into the bone marrow. Aspects related to pathophysiology, clinical manifestations, laboratory, study and treatment are described. These pieces of information are necessary to accomplish a better ...
متن کاملRelaxed Update and Partition Network Games
In this paper, we study the complexity of deciding which player has a winning strategy in certain types of McNaughton games. These graph games can be used as models for computational problems and processes of infinite duration. We consider the cases (1) where the first player wins when vertices in a specified set are visited infinitely often and vertices in another specified set are visited fin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Discrete Algorithms
سال: 2003
ISSN: 1570-8667
DOI: 10.1016/s1570-8667(03)00006-6